منابع مشابه
Minimization of semilinear automata
We investigate finite deterministic automata in sets with non-homogeneous atoms: integers with successor. As there are uncount-ably many deterministic finite automata in this setting, we restrict our attention to automata with semilinear transition function. The main results is a minimization procedure for semilinear automata. The proof is subtle and refers to decidability of existential Presbu...
متن کاملMinimization of Automata
This chapter is concerned with the design and analysis of algorithms for minimizingfinite automata. Getting a minimal automaton is a fundamental issue in the use and implementationof finite automata tools in frameworks like text processing, image analysis, linguistic computerscience, and many other applications.Although minimization algorithms are rather old, there were recently...
متن کاملMinimization of Binary Automata
Finite automata used to represent large vocabularies of natural languages are quite sparse in the following sense: for the vast majority of states, almost all transitions lead to the rejecting state. This suggests a representation of the automaton in which each state is a small list of transitions entering non rejecting states. By reordering those lists and merging common sublists, it is possib...
متن کاملAutomata Minimization: a Functorial Approach
In this paper we regard languages and their acceptors – such as deterministic or weighted automata, transducers, or monoids – as functors from input categories that specify the type of the languages and of the machines to categories that specify the type of outputs. Our results are as follows: a) We provide sufficient conditions on the output category so that minimization of the corresponding a...
متن کاملBisimulation Minimization of Tree Automata
We extend an algorithm by Paige and Tarjan that solves the coarsest stable refinement problem to the domain of trees. The algorithm is used to minimize non-deterministic tree automata (NTA) with respect to bisimulation. We show that our algorithm has an overall complexity of O(r̂ m log n), where r̂ is the maximum rank of the input alphabet, m is the total size of the transition table, and n is th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2013
ISSN: 0362-1340,1558-1160
DOI: 10.1145/2480359.2429079